Bi-induced Subgraphs and Stability Number*

نویسندگان

  • I. E. ZVEROVICH
  • O. I. ZVEROVICH
  • I. E. Zverovich
  • O. I. Zverovich
چکیده

We define a 2-parametric hierarchy ( , ) m n CLAP of bi-hereditary classes of graphs, and show that a maximum stable set can be found in polynomial time within each class ( , ) m n CLAP . The classes can be recognized in polynomial time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytical Study of Optical Bi-Stability of a Single-Bus Resonator Based on InGaAs Micro-Ring Array

In this paper, for the first time to our knowledge, we investigate the optical bi-stability in a compact parallel array of micro- ring resonators with 5μm radius, induced by optical nonlinearity. Due to the nature of perfect light confinement, resonance and accumulation process in a ring resonator, optical nonlinear effects, even at small optical power of a few milliwatts in this structure are ...

متن کامل

Instabilities of Thin Viscous Liquid Film Flowing down a Uniformly Heated Inclined Plane

Instabilities of a thin viscous film flowing down a uniformly heated plane are investigated in this study. The heating generates a surface tension gradient that induces thermocapillary stresses on the free surface. Thus, the film is not only influenced by gravity and mean surface tension but also the thermocapillary force is acting on the free surface. Moreover, the heat transfer at the free su...

متن کامل

The parameterised complexity of counting even and odd induced subgraphs

We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges. We demonstrate that both problems are #W[1]-hard when parameterised by k, in fact proving a somewhat stronger result about counting subgraphs with a propert...

متن کامل

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...

متن کامل

Optimization of Sensitivity and Stability of Gold/Silver bi-Layer Thin Films Used in Surface Plasmon Resonance Chips

The aim of this study is experimental assay of sensitivity and stability of a bimetallic silver/gold SPR sensor chip. This chip utilizes the sensitivity of the silver and the stability of the gold. Moreover, the Silver layer (instead of usual Cr or Ti layer) was used as an adhesive intermediate layer between the Gold layer and the glass substrate. The optimization of the Gold/Silver thickness u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005